Determinantal Processes with Number Variance Saturation
نویسندگان
چکیده
منابع مشابه
Determinantal Processes with Number Variance Saturation
Abstract. Consider Dyson’s Hermitian Brownian motion model after a finite time S, where the process is started at N equidistant points on the real line. These N points after time S form a determinantal process and has a limit as N → ∞. This limting determinantal proceess has the interesting feature that it shows number variance saturation. The variance of the number of particles in an interval ...
متن کاملMoving Average Processes with Infinite Variance
The sample autocorrelation function (acf) of a stationary process has played a central statistical role in traditional time series analysis, where the assumption is made that the marginal distribution has a second moment. Now, the classical methods based on acf are not applicable in heavy tailed modeling. Using the codifference function as dependence measure for such processes be shown it be as...
متن کاملMarkov Determinantal Point Processes
A determinantal point process (DPP) is a random process useful for modeling the combinatorial problem of subset selection. In particular, DPPs encourage a random subset Y to contain a diverse set of items selected from a base set Y . For example, we might use a DPP to display a set of news headlines that are relevant to a user’s interests while covering a variety of topics. Suppose, however, th...
متن کاملDeterminantal Processes and Independence
Abstract: We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees). They have the striking property that the number of points in a region D is a sum of independent Bernoulli random variables, with parameters which a...
متن کاملStructured Determinantal Point Processes
We present a novel probabilistic model for distributions over sets of structures— for example, sets of sequences, trees, or graphs. The critical characteristic of our model is a preference for diversity: sets containing dissimilar structures are more likely. Our model is a marriage of structured probabilistic models, like Markov random fields and context free grammars, with determinantal point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2004
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-004-1186-4